A Grammar Used for Parsing and Generation
نویسندگان
چکیده
Martin KAY has shown that parsing and generation could be done using Functional Grammars. APPELT lAPP85] and McKEOWN [McK82], among others, have used Functional Grammars for generation. Usually the grammar formalism is more suited to parsing than to generation. The way a grammar is processed for parsing is rather clear, while the generating process needs strong assumptions on the interpreter to be easily readable.
منابع مشابه
Compiling Trace And Unification Grammar For Parsing And Generation
This paper presents Trace & Unification Grammar (TUG), a declarative and reversible grammar formalism that brings together Unification Grammar (uG) and ideas of Government & Binding Theory (GB) in an undogmatic way. A grammar compiler is presented that transforms a grammar written in the TUG formalism into two different forms, one being useful for parsing, the other being useful for generation....
متن کاملReversibility and Self-monitoring in Natural Language Generation
This paper shows how the use of reversible grammars may lead to eecient and exible natural language parsing and generation systems. In particular a mechanism is described which ensures that only non-ambiguous utterances are produced. This mechanism uses the parsing component to monitor the generation component. The relevant communication between the two components is performed using derivation ...
متن کاملA Symbolic Approach to Near-Deterministic Surface Realisation using Tree Adjoining Grammar
Surface realisers divide into those used in generation (NLG geared realisers) and those mirroring the parsing process (Reversible realisers). While the first rely on grammars not easily usable for parsing, it is unclear how the second type of realisers could be parameterised to yield from among the set of possible paraphrases, the paraphrase appropriate to a given generation context. In this pa...
متن کاملیک مدل بیزی برای استخراج باناظر گرامر زبان طبیعی
In this paper, we show that the problem of grammar induction could be modeled as a combination of several model selection problems. We use the infinite generalization of a Bayesian model of cognition to solve each model selection problem in our grammar induction model. This Bayesian model is capable of solving model selection problems, consistent with human cognition. We also show that using th...
متن کاملA uniform architecture for parsing and generation
The use of a single grammar for both parsing and generation is an idea with a certain elegance, the desirability of which several researchers have noted. In this paper, we discuss a more radical possibility: not only can a single grammar be used by different processes engaged in various "directions" of processing, but one and the same language-processing architecture can be used for processing ...
متن کامل